Papers with fine-tuning procedure

15 papers
Paraphrase Identification via Textual Inference (2024.starsem-1)

Copied to clipboard

Challenge: Paraphrase identification (PI) and natural language inference (NLI) are important tasks in natural language processing.
Approach: They propose a method for paraphrase identification and natural language inference using an NLI system to solve these tasks.
Outcome: The proposed method outperforms dedicated PI models on PI datasets and provides insights into limitations of current benchmarks.
Maximal Multiverse Learning for Promoting Cross-Task Generalization of Fine-Tuned Language Models (2021.eacl-main)

Copied to clipboard

Challenge: Recent studies suggest the use of general language models for improving natural language processing tasks.
Approach: They propose a method that leverages the second phase to its fullest by applying an extensive number of parallel classifier heads, which are enforced to be orthogonal, while adaptively eliminating the weaker heads during training.
Outcome: The proposed method improves the generalization ability of BERT, sometimes leading to a +9% gain in accuracy.
FPC: Fine-tuning with Prompt Curriculum for Relation Extraction (2022.aacl-main)

Copied to clipboard

Challenge: Existing methods for relation extraction ignore semantics of relation labels . prompt-based fine-tuning has been proposed for RE .
Approach: They propose a method for relation extraction using prompt-based fine-tuning . they use auxiliary prompt-tuned learning task to make the model capture semantics of relation labels .
Outcome: The proposed method outperforms existing methods on four widely used RE benchmarks under fully supervised and low-resource settings.
Prompt-based Text Entailment for Low-Resource Named Entity Recognition (2022.coling-1)

Copied to clipboard

Challenge: Pre-trained Language Models (PLMs) have been applied in NLP tasks but require labeled data for downstream tasks.
Approach: They propose a method for low-resource named entity recognition that uses prompts to get entailment scores for each candidate and inject tagging labels into prompts.
Outcome: The proposed method achieves competitive performance on the CoNLL03 dataset, and better than fine-tuned counterparts on the MIT Movie and Few-NERD datasets in low-resource settings.
UDALM: Unsupervised Domain Adaptation through Language Modeling (2021.naacl-main)

Copied to clipboard

Challenge: Existing techniques for unsupervised domain adaptation (UDA) are limited by domain shift, which leads to performance degradation.
Approach: They propose a fine-tuning procedure that uses a mixed classification and Masked Language Model loss to adapt to the target domain distribution in a robust and sample efficient manner.
Outcome: The proposed procedure can adapt to the target domain distribution in a robust and sample efficient manner.
Semi-supervised Domain Adaptation for Dependency Parsing (P19-1)

Copied to clipboard

Challenge: Currently, most studies on cross-domain parsing focus on unsupervised domain adaptation . however, unsupervised approaches make limited progress due to the intrinsic difficulty of both domain adaptation and parse.
Approach: They propose a semi-supervised domain adaptation problem for Chinese dependency parsing by using newly-annotated large-scale domain-aware datasets.
Outcome: The proposed method is more effective than direct corpus concatenation and multi-task learning.
Explanations for CommonsenseQA: New Dataset and Models (2021.acl-long)

Copied to clipboard

Challenge: a dataset called CommonsenseQA (CQA) was recently released to advance the research on common-sense question answering (QA)
Approach: They propose to retrieve and generate explanations for a given question, correct answer choice, incorrect answer choices tuple from a dataset called CommonsenseQA.
Outcome: The proposed model beats baseline model by 100% in F1 score and similarity score of 61.9 .
Self-Supervised Curriculum Learning for Spelling Error Correction (2021.emnlp-main)

Copied to clipboard

Challenge: Current approaches to SEC typically leverage a pre-training then fine-tuning procedure that treats data equally.
Approach: They propose a self-supervised curriculum learning approach to improve model performance and model learning.
Outcome: The proposed approach improves the model training and improves CL measurement.
CARFT: Boosting LLM Reasoning via Contrastive Learning with Annotated Chain-of-Thought-based Reinforced Fine-Tuning (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to improve the reasoning performance of Large Language Models (LLMs) ignore annotated Chain-of-Thought (CoT) and incorporate unstable reasoning path sampling.
Approach: They propose a Contrastive learning with annotated CoT-based Reinforced Fine-Tuning approach to enhance the reasoning performance of Large Language Models.
Outcome: The proposed approach exploits annotated CoT and stabilizes the fine-tuning procedure by incorporating an additional unsupervised learning signal.
Enhancing Pre-trained Chinese Character Representation with Word-aligned Attention (2020.acl-main)

Copied to clipboard

Challenge: Pre-trained Chinese language models take character as the basic unit and learn representation according to character’s external contexts, ignoring the semantics expressed in the word, which is the smallest meaningful utterance in Chinese.
Approach: They propose to pool character-level attention to the word level and propose to alleviate the potential issue of segmentation error propagation by multi-source information fusion.
Outcome: The proposed approach improves on five Chinese NLP benchmark tasks against BERT, ERNIE and BERT-wwm.
Pre-training Is (Almost) All You Need: An Application to Commonsense Reasoning (2020.acl-main)

Copied to clipboard

Challenge: Existing methods for solving common NLP tasks rely on fine-tuning of pre-trained transformer models.
Approach: They propose a scoring method that casts a plausibility ranking task in full-text format without fine-tuning . they use masked language modeling head tuned during pre-training phase to exploit this method .
Outcome: The proposed method produces strong baselines comparable to supervised approaches.
Visualizing and Understanding the Effectiveness of BERT (D19-1)

Copied to clipboard

Challenge: Language model pre-training, such as BERT, has achieved strong performance in many NLP tasks.
Approach: They propose to visualize loss landscapes and optimization trajectories of fine-tuning BERT on specific datasets.
Outcome: The proposed model improves performance and generalization capability across tasks.
Enhancing Parameter-efficient Fine-tuning with Simple Calibration Based on Stable Rank (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for lightweight fine-tuning are ineffective in low-resource settings but fail in high-resourced settings, leading to unreliable outcomes.
Approach: They propose a calibration strategy that takes into account the inherent variance of generalization ability in model components and potential changes during the fine-tuning process.
Outcome: The proposed calibration improves GLUE score by 3.1 points over the previous calibration method.
Model Intrinsic Features of Fine-tuning based Text Summarization Models for Factual Consistency (2023.findings-acl)

Copied to clipboard

Challenge: a summarization model with relatively low factual consistency is more likely to model summaries that are not conditional to the documents.
Approach: They analyze the model intrinsic features by varying the fine-tuning objectives and datasets.
Outcome: The proposed models have a high inductive bias for factual consistency and are more likely to model summaries that are not conditional to the documents.
Exploring Intrinsic Language-specific Subspaces in Fine-tuning Multilingual Neural Machine Translation (2024.emnlp-main)

Copied to clipboard

Challenge: Multilingual neural machine translation models support fine-tuning hundreds of languages simultaneously.
Approach: They propose to fine-tune a language in its intrinsic subspace with a tiny fraction of entire parameters.
Outcome: The proposed methods outperform full-parameter fine-tuning up to 2.25 spBLEU scores and reduce trainable parameters to 0.4% for high and medium-resource languages and 1.6% for low-resourced ones.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations